Book embeddings of graphs and a theorem of Whitney
نویسنده
چکیده
It is shown that the number of pages required for a book embedding of a graph is the maximum of the numbers needed for any of the maximal nonseparable subgraphs and that a plane graph in which every triangle bounds a face has a two-page book embedding. The latter extends a theorem of H. Whitney and gives two-page book embeddings for X-trees and square grids.
منابع مشابه
Labeling Subgraph Embeddings and Cordiality of Graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$. For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...
متن کاملFlexibility of Polyhedral Embeddings of Graphs in Surfaces
Whitney s theorem states that connected planar graphs admit essentially unique embeddings in the plane We generalize this result to em beddings of graphs in arbitrary surfaces by showing that there is a function N N such that every connected graph admits at most g combina torially distinct embeddings of face width into surfaces whose Euler genus
متن کاملOn the Ultramean Construction
We use the ultramean construction to prove linear compactness theorem. We also extend the Rudin-Keisler ordering to maximal probability charges and characterize it by embeddings of power ultrameans.
متن کاملBook embeddings of Reeb graphs
Let X be a simplicial complex with a piecewise linear function f : X → R. The Reeb graph Reeb(f,X) is the quotient of X, where we collapse each connected component of f−1(t) to a single point. Let the nodes of Reeb(f,X) be all homologically critical points where any homology of the corresponding component of the level set f−1(t) changes. Then we can label every arc of Reeb(f,X) with the Betti n...
متن کاملExtremal Graph Theory for Book-Embeddings
A book-embedding of a graph is a linear ordering of its vertices, and a partition of its edges into non-crossing sets (called pages). The pagenumber of a graph is the minimum number of pages for which it has a book-embedding. After introducing concepts relevant to book-embeddings and their applications, we will describe the main results on the pagenumber for classes of graphs, particularly resu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003